ar X iv : 1 50 4 . 01 70 9 v 1 [ cs . F L ] 7 A pr 2 01 5 On the expressibility of copyless cost register automata

نویسنده

  • Cristian Riveros
چکیده

Cost register automata (CRA) were proposed by Alur et all as an alternative model for weighted automata. In hope of finding decidable subclasses of CRA, they proposed to restrict their model with the copyless restriction but nothing is really know about the structure or properties of this new computational model called copyless CRA. In this paper we study the properties and expressiveness of copyless CRA. We propose a normal form for copyless CRA and we study the properties of a special group of registers (called stable registers). Furthermore, we find that copyless CRA do not have good closure properties since we show that they are not closed under reverse operation. Finally, we propose a subclass of copyless CRA and we show that this subclass is closed under regular-lookahead.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : 1 70 3 . 07 94 9 v 3 [ cs . C R ] 4 A pr 2 01 7 1 Anonymized Local Privacy

In this paper, we introduce the family of Anonymized Local Privacy mechanisms. These mechanisms have an output space of multiple values (e.g.,“Yes”, “No”, or “⊥” (not participating)) and leverage the law of large numbers to generate linear noise in the number of data owners to protect privacy both before and after aggregation yet preserve accuracy. We describe the suitability in a distributed o...

متن کامل

ar X iv : 1 70 3 . 07 94 9 v 3 [ cs . C R ] 4 A pr 2 01 7 1 Anonymized Local Privacy Joshua Joy

In this paper, we introduce the family of Anonymized Local Privacy mechanisms. These mechanisms have an output space of multiple values (e.g.,“Yes”, “No”, or “⊥” (not participating)) and leverage the law of large numbers to generate linear noise in the number of data owners to protect privacy both before and after aggregation yet preserve accuracy. We describe the suitability in a distributed o...

متن کامل

Automating Image Analysis by Annotating Landmarks with Deep Neural Networks

3 Introduction 3 Materials and Methods 5 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 Deep Neural Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 Deep Neural Network Architecture . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 Experimental Setup . . . . ...

متن کامل

On the expressibility of copyless cost register automata

Cost register automata (CRA) were proposed by Alur et all as an alternative model for weighted automata. In hope of finding decidable subclasses of CRA, they proposed to restrict their model with the copyless restriction but nothing is really know about the structure or properties of this new computational model called copyless CRA. In this paper we study the properties and expressiveness of co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015